#include<unordered_set>
#include<unordered_map>
#include<set>
#include<iostream>
using namespace std;

#include "hashtable.h"

void testht()
{
	HashTable<int, int> ht;
	int a[] = { 19,30,5,36,13,20,21,12 };
	for (auto e : a)
	{
		ht.Insert({ e,e });
	}

	cout << ht.Find(20) << endl;
	cout << ht.Find(9) << endl;

	ht.Erase(30);
	
	cout << ht.Find(20) << endl;
	cout << ht.Find(9) << endl;
	cout << ht.Find(30) << endl;
}

int main()
{
	//test_set2();
	testht();
	return 0;
}